The structure of preenvelopes with respect to maximal Cohen–Macaulay modules
نویسندگان
چکیده
منابع مشابه
LIFTING MODULES WITH RESPECT TO A PRERADICAL
Let $M$ be a right module over a ring $R$, $tau_M$ a preradical on $sigma[M]$, and$Ninsigma[M]$. In this note we show that if $N_1, N_2in sigma[M]$ are two$tau_M$-lifting modules such that $N_i$ is $N_j$-projective ($i,j=1,2$), then $N=N_1oplusN_2$ is $tau_M$-lifting. We investigate when homomorphic image of a $tau_M$-lifting moduleis $tau_M$-lifting.
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولlifting modules with respect to a preradical
let $m$ be a right module over a ring $r$, $tau_m$ a preradical on $sigma[m]$, and$ninsigma[m]$. in this note we show that if $n_1, n_2in sigma[m]$ are two$tau_m$-lifting modules such that $n_i$ is $n_j$-projective ($i,j=1,2$), then $n=n_1oplusn_2$ is $tau_m$-lifting. we investigate when homomorphic image of a $tau_m$-lifting moduleis $tau_m$-lifting.
متن کاملGraphs maximal with respect to hom-properties
For a simple graph H, → H denotes the class of all graphs that admit homomorphisms to H (such classes of graphs are called homproperties). We investigate hom-properties from the point of view of the lattice of hereditary properties. In particular, we are interested in characterization of maximal graphs belonging to → H. We also provide a description of graphs maximal with respect to reducible h...
متن کاملMaximal graphs with respect to hereditary properties
A property of graphs is a non-empty set of graphs. A property P is called hereditary if every subgraph of any graph with property P also has property P. Let P1, . . . ,Pn be properties of graphs. We say that a graph G has property P1◦ · · · ◦Pn if the vertex set of G can be partitioned into n sets V1, . . . , Vn such that the subgraph of G induced by Vi has property Pi; i = 1, . . . , n. A here...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2016
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2015.09.042